package leetcode.integer;

public interface SolutionService {

	/**
	 * 7.Reverse Integer
	 * @param x
	 * @return
	 */
	int reverse(int x);

	/**
	 * 9.Palindrome Number
	 * @param x
	 * @return
	 */
	boolean isPalindrome(int x);

	/**
	 * 11.Container With Most Water
	 * @param height
	 * @return
	 */
	int maxArea(int[] height);

	/**
	 * 70.Climbing Stairs
	 * https://www.cnblogs.com/grandyang/p/4079165.html
	 * @param n
	 * @return
	 */
	int climbStairs(int n);

	/**
	 * 231. Power of Two
	 * @param n
	 * @return
	 */
	boolean isPowerOfTwo(int n);

	/**
	 * 258. Add Digits
	 * https://blog.csdn.net/jmspan/article/details/51103086
	 * @param num
	 * @return
	 */
	int addDigits(int num);

	/**
	 * 342. Power of Four
	 * https://leetcode.com/problems/power-of-four/
	 * @param num
	 * @return
	 */
	boolean isPowerOfFour(int num);

	/**
	 * 326. Power of Three
	 * @param n
	 * @return
	 */
	boolean isPowerOfThree(int n);
	
}
